Metastable Behavior for Bootstrap Percolation on Regular Trees
نویسندگان
چکیده
We examine bootstrap percolation on a regular (b + 1)-ary tree with initial law given by Bernoulli(p). The sites are updated according to the usual rule: a vacant site becomes occupied if it has at least θ occupied neighbors, occupied sites remain occupied forever. It is known that, when b > θ ≥ 2, the limiting density q = q(p) of occupied sites exhibits a jump at some pT = pT(b, θ) ∈ (0, 1) from qT := q(pT) < 1 to q(p) = 1 when p > pT. We investigate the metastable behavior associated with this transition. Explicitly, we pick p = pT + h with h > 0 and show that, as h ↓ 0, the system lingers around the “critical” state for time order h−1/2 and then passes to fully occupied state in time O(1). The law of the entire configuration observed when the occupation density is q ∈ (qT, 1) converges, as h ↓ 0, to a well-defined measure.
منابع مشابه
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deterministic spreading rule with a fixed parameter k: if a vacant site has at least k occupied neighbors at a certain time step, then it becomes occupied in the next step. This process is well-studied on Z; here we investigate it o...
متن کاملBootstrap Percolation on Periodic Trees
We study bootstrap percolation with the threshold parameter θ ≥ 2 and the initial probability p on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers, and starting from a given node, called root, all nodes at the same graph distance from the root have the same degree. We show the existence of the cri...
متن کاملStrict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
We study the strict majority bootstrap percolation process on graphs. Vertices may be active or passive. Initially, active vertices are chosen independently with probability p. Each passive vertex v becomes active if at least d deg(v)+1 2 e of its neighbors are active (and thereafter never changes its state). If at the end of the process all vertices become active then we say that the initial s...
متن کاملA simple model for the earthquake cycle combining self-organized complexity with critical point behavior
We have studied a hybrid model combining the forest-fire model with the site-percolation model in order to better understand the earthquake cycle. We consider a square array of sites. At each time step, a “tree” is dropped on a randomly chosen site and is planted if the site is unoccupied. When a cluster of “trees” spans the site (a percolating cluster), all the trees in the cluster are removed...
متن کاملBootstrap percolation on Galton–Watson trees
Bootstrap percolation is a type of cellular automaton which has been used to model various physical phenomena, such as ferromagnetism. For each natural number r, the r-neighbour bootstrap process is an update rule for vertices of a graph in one of two states: ‘infected’ or ‘healthy’. In consecutive rounds, each healthy vertex with at least r infected neighbours becomes itself infected. Percolat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009